Branch-and-cut algorithms for the undirected m
نویسندگان
چکیده
In the m-Peripatetic Salesman Problem (m-PSP) the aim is to determine m edge disjoint Hamiltonian cycles of minimum total cost on a graph. This article describes exact branch-and-cut solution procedures for the undirected m-PSP. Computational results are reported on random and Euclidean graphs.
منابع مشابه
Two optimal algorithms for finding bi-directional shortest path design problem in a block layout
In this paper, Shortest Path Design Problem (SPDP) in which the path is incident to all cells is considered. The bi-directional path is one of the known types of configuration of networks for Automated Guided Vehi-cles (AGV).To solve this problem, two algorithms are developed. For each algorithm an Integer Linear Pro-gramming (ILP) is determined. The objective functions of both algorithms are t...
متن کاملImproved Exact Exponential Algorithms for Vertex Bipartization and Other Problems
We study efficient exact algorithms for several problems including Vertex Bipartization, Feedback Vertex Set, 3-Hitting Set, Max Cut in graphs with maximum degree at most 4. Our main results include: 1. an O(1.9526) 1 algorithm for Vertex Bipartization problem in undirected graphs; 2. an O(1.8384) algorithm for Vertex Bipartization problem in undirected graphs of maximum degree 3; 3. an O(1.945...
متن کاملConnectivity Measures for Internet Topologies
The topology of the Internet has initially been modelled as an undirected graph, where vertices correspond to so-called Autonomous Systems (ASs), and edges correspond to physical links between pairs of ASs. However, in order to capture the impact of routing policies, it has recently become apparent that one needs to classify the edges according to the existing economic relationships (customer-p...
متن کاملPrimal and Dual Bounds for the Prize-collecting Steiner Problem in Graphs
Given an undirected graph G with associated edge costs and vertex penalties, a Prize Collecting Steiner (PCS) tree is either an isolated vertex of G or else any tree of that graph. The weight of a PCS tree equals the sum of its edge costs plus the sum of the penalties for the vertices of G not spanned by the tree. The Prize Collecting Steiner Problem in Graphs (PCSPG) is to find a PCS tree of l...
متن کاملA branch-and-cut algorithm for the minimum branch vertices spanning tree problem
Given a connected undirected graph G = (V;E), the Minimum Branch Vertices Problem (MBVP) asks for a spanning tree of G with the minimum number of vertices having degree greater than two in the tree. These are called branch vertices. This problem, which has an application in the context of optical networks, is known to be NPhard. We model the MBVP as an integer linear program, with undirected va...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- European Journal of Operational Research
دوره 162 شماره
صفحات -
تاریخ انتشار 2005